Functionally Expressible Multidistances
نویسندگان
چکیده
In this paper we deal with the problem of aggregating pairwise distance values in order to obtain a multi-argument distance function. After introducing the concept of functionally expressible multidistance, several essential types of multidimensional aggregation functions are considered to construct such kind of multidistances. An example of non functionally expressible multidistance is exhibited.
منابع مشابه
Constructing non-functionally expressible fuzzy implications
This article discusses a new method for the construction of non-functionally expressible fuzzy implications. In a recent work, we have considered non-functionally expressible fuzzy implications from an implication function acting on the inputs followed by an aggregation process. Now, we first perform an aggregation of the inputs and then an implication function between the aggregated values. Th...
متن کاملMulti-argument distances
In this paper, we propose a formal definition of a multi-argument function distance. The conventional definition of a distance is extended to apply to collections of more than two elements. Some general properties of multidistances are investigated and significant examples are exhibited. Finally, we introduce the concept of ball centered at a list in order to extend the one of the usual ball in...
متن کاملExpressible Semantics for Expressible Counterfactuals
Lewis (1981) showed the equivalence between two dominant semantic frameworks for counterfactuals: ordering semantics, which relies on orders between possible worlds, and premise semantics, which relies on sets of propositions (so-called ordering sources). I define a natural, restricted version of premise semantics, expressible premise semantics, which is based on ordering sources containing onl...
متن کاملUntestable Properties Expressible with Four First-Order Quantifiers
In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a small, random sample of the structure. We focus on the classification of first-order sentences based on their quantifier prefixes and vocabulary into testable and untestable classes. This classification was initiated by Alon e...
متن کاملOn an Algebraic Classification of Multidimensional Recursively Enumerable Sets Expressible in Formal Arithmetical Systems
Algebraic representations of multidimensional recursively enumerable sets which are expressible in formal arithmetical systems based on the signatures ) , , , 0 ( S , ) , , , 0 ( S , ) , , 0 ( S , where 1 ) ( x x S , are introduced and investigated. The equivalence is established between the algebraic and logical representations of multidimensional recursively enumerable sets expr...
متن کامل